On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events
نویسندگان
چکیده
The probabilistic logic FP(Ł,Ł) was axiomatized with the aim of presenting a formal setting for reasoning about probability infinite-valued Łukasiewicz events. Besides several attempts, proving that axiomatic system to be complete respect class standard models, remained an open problem since first paper on published in 2007. In this article we give solution it. particular introduce two semantics system: one based states and second regular Borel measures prove is both these classes models. Further, will show finite model property holds FP(Ł,Ł).
منابع مشابه
On Affine Logic and Łukasiewicz Logic
The multi-valued logic of Lukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation elimination, [DNE]. However, our understanding of Lukasiewicz logic can be improved by separating its classical and intuitionistic aspects. The intuitionistic aspect of Lukasiewicz logic ...
متن کاملOn the Finite Model Property in Order-Sorted Logic
The Schoenfinkel-Bernays-Ramsey class is a fragment of first-order logic with the Finite Model Property: a sentence in this class is satisfiable if and only if it is satisfied in a finite model. Since an upper bound on the size of such a model is computable from the sentence, the satisfiability problem for this family is decidable. Sentences in this form arise naturally in a variety of applicat...
متن کاملFinite Model Property of Pretransitive Modal Logic
The finite model property of the quasi-transitive modal logic K32 = K ⊕ ✷✷p → ✷✷✷p is proved. This modal logic is conservatively extended to the tense logic Kt32. We present a Gentzen sequent calculus Gt32 for Kt 3 2 which admits cut elimination. The sequent calculus Gt 3 2 is shown to have the finite model property by a construction of finite syntactic model. It follows that Kt32 has the finit...
متن کاملOn Completeness Results of Hoare Logic Relative to the Standard Model
The general completeness problem of Hoare logic relative to the standard model N of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical formulas as assertions. In practice, the assertions would be simple arithmetical formulas, e.g. of a low level in the arithmetical hierarchy. In addition, we find that, by restricting inputs to N , the complexity of th...
متن کاملThe Finite Model Property for Various Fragments of Linear Logic
To show that a formula A is not provable in propositional classical logic, it suuces to exhibit a nite boolean model which does not satisfy A. A similar property holds in the intuitionistic case, with Kripke models instead of boolean models (see for instance TvD88]). One says that the propositional classical logic and the propositional intuitionistic logic satisfy a nite model property. In part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2021
ISSN: ['1873-4731', '0888-613X']
DOI: https://doi.org/10.1016/j.ijar.2020.12.023